Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory
نویسنده
چکیده
Article history: Received 29 February 2016 Received in revised form 27 June 2016 Accepted 25 July 2016 Available online 12 August 2016
منابع مشابه
Huge tables are fixed parameter tractable via unimodular integer Caratheodory
The three-way table problem is to decide if there exists an l × m × n table satisfying given line sums, and find a table if yes. Recently, it was shown to be fixed-parameter tractable with parameters l, m. Here we extend this and show that the huge version of the problem, where the variable side n is encoded in binary, is also fixed-parameter tractable with parameters l, m. We also conclude tha...
متن کاملHuge Unimodular N-Fold Programs
Optimization over l ×m× n integer 3-way tables with given line-sums is NP-hard already for fixed l = 3, but is polynomial time solvable with both l,m fixed. In the huge version of the problem, the variable dimension n is encoded in binary, with t layer types. It was recently shown that the huge problem can be solved in polynomial time for fixed t, and the complexity of the problem for variable ...
متن کاملA fixed-parameter tractability result for multicommodity demand flow in trees
We study an NP-hard (and MaxSNP-hard) problem in trees—Multicommodity Demand Flow—dealing with demand flows between pairs of nodes and trying to maximize the value of the routed flows. This problem has been intensively studied for trees as well as for general graphs mainly from the viewpoint of polynomialtime approximation algorithms. By way of contrast, we provide an exact dynamic programming ...
متن کاملThe complexity landscape of decompositional parameters for ILP
Integer Linear Programming (ILP) can be seen as the archetypical problem for NP-complete optimization problems, and a wide range of problems in artificial intelligence are solved in practice via a translation to ILP. Despite its huge range of applications, only few tractable fragments of ILP are known, probably the most prominent of which is based on the notion of total unimodularity. Using ent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 83 شماره
صفحات -
تاریخ انتشار 2017